Byzantine Agreement in Sensor Networks
نویسنده
چکیده
This paper is the outcome of a study for three algorithms that can be used to solve the Byzantine Generals/Agreement problem in sensor networks. Sensor networks are in this way different from the regular networks, where solutions have been proposed for, that they use broadcasting to communicate with other nodes. This paper presents one algorithm for reaching Byzantine Agreement in fully connected sensor networks and two algorithms for reaching Byzantine Agreement in not fully connected sensor networks. It shows that the protocol presented for the fully connected network can reach agreement with a maximum of n/2 dishonest nodes. It further shows that the two protocols presented for the not fully connected network also solve the Byzantine Agreement problem. One of these protocols can tolerate up to n/2 dishonest nodes, the other protocol can tolerate any number of dishonest nodes.
منابع مشابه
Security Analysis of Lightweight Authentication Scheme with Key Agreement using Wireless Sensor Network for Agricultural Monitoring System
Wireless sensor networks have many applications in the real world and have been developed in various environments. But the limitations of these networks, including the limitations on the energy and processing power of the sensors, have posed many challenges to researchers. One of the major challenges is the security of these networks, and in particular the issue of authentication in the wireles...
متن کاملByzantine Fault-Tolerant Routing for Large-Scale Wireless Sensor Networks Based on Fast ECDSA
Wireless sensor networks are a favorite target of Byzantine malicious attackers because of their limited energy, low calculation capability, and dynamic topology, and other important characteristics. The Byzantine Generals Problem is one of the classical problems in the area of fault tolerance, and has wide application, especially in distributed databases and systems. There is a lot of research...
متن کاملOptimal byzantine resilient convergence in oblivious robot networks
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, but unknown beforehand, location. Robots are oblivious— they do not recall the past computations — and are allowed to move in a one-dimensional space. Additionally, robots cannot communicate directly, instead they obta...
متن کاملAn Optimal Agreement in a Cluster-based Wireless Sensor Network with Malicious Faulty Nodes
A cluster of sensor nodes in Cluster-based Wireless Sensor Network (CWSN) is cooperating to achieve some objectives. For CWSN, the fault-tolerance and reliability has been an important topic. The problem of reaching agreement in the distributed system is one of the most important issues to design a fault-tolerance system. In previous works, reach a common agreement among healthy nodes to cope w...
متن کاملAn Improved Byzantine Fault-tolerant Program for WSNs
In order to increase the level of fault-tolerance of wireless sensor networks, thus to enhance the reliability and accuracy, we studies the traditional byzantine fault-tolerant program, and makes improvements in the environment of WSNs, reducing the number of rounds of message exchange between network nodes, thus improving the efficiency and reducing communication overhead and energy consumptio...
متن کامل